Solving the Set Packing Problem via a Maximum Weighted Independent Set Heuristic
نویسندگان
چکیده
منابع مشابه
Hybrid Heuristic for the Maximum-Weight Independent Set Problem
We propose an approximate algorithm for finding the maximum-weight independent set of a given graph of n nodes with associated weights. It combines three different heuristics, and its running time is O(n2) in the practice. We also propose a set of random graphs for testing and comparing the maximumweight independent set algorithms. This graphs are easy to identically generate on any computer ca...
متن کاملAn Evolutionary Heuristic for the Maximum Independent Set Problem
|The results obtained from the application of a genetic algorithm, GENEsYs, to the NP-complete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domain-speciic knowledge, the approach presented here relies on a graded penalty term component of the tness function to penalize infeasible solutions. The method is applied...
متن کاملA Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problem
A dynamical model based upon a physical metaphor is described, and a parallel algorithm inspired from the model is developed for approximately solving maximum weight independent set problem. Our model treats an independent set as an attraction game, where vertices of the graph are considered as still bodies and edges as cells attracted by the still bodies corresponding to its extremities. In ad...
متن کاملUsing Critical Sets for the Maximum Independent Set Problem Solving
The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method that utilizes a nonempty critical independent set for solving the maximum independent set problem is developed. The efficiency of the proposed...
متن کامل3D DNA self-assembly for maximum weighted independent set problem
The problem of finding a maximum weighted independent set (MWIS) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete (NPC). A 2-D DNA tile self-assembly model for solving the problem has been proposed previously, but it still has many deficiencies. In this paper, we will propose a 3-D DNA tile self-assembly model based on 2D DNA tile self-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2020/3050714